Q: Which of the following real world scenarios would you associate with a stack data structure?
A. piling up of chairs one above the other
B. people standing in a line to be serviced at a counter
C. offer services based on the priority of the customer
D. tatkal Ticket Booking in IRCTC
Solution: Stack follows Last In First Out (LIFO) policy. Piling up of chairs one above the other is based on LIFO, people standing in a line is a queue and if the service is based on priority, then it can be associated with a priority queue. Tatkal Ticket Booking Follows First in First Out Policy. People who click the book now first will enter the booking page first.
Q: What does the following function check for? (all necessary headers to be included and function is called from main)
#define MAX 10
typedef struct stack
{
int top;
int item[MAX];
}stack;
int function(stack *s)
{
if(s->top == -1)
return 1;
else return 0;
}
A. full stack
B. invalid index
C. empty stack
D. infinite stack
Solution: An empty stack is represented with the top-of-the-stack(‘top’ in this case) to be equal to -1.
Q: What does ‘stack underflow’ refer to?
A. accessing item from an undefined stack
B. adding items to a full stack
C. removing items from an empty stack
D. index out of bounds exception
Solution: Removing items from an empty stack is termed as stack underflow.
Q: What is the output of the following program?
public class Stack
{
protected static final int CAPACITY = 100;
protected int size,top = -1;
protected Object stk[];
public Stack()
{
stk = new Object[CAPACITY];
}
public void push(Object item)
{
if(size_of_stack==size)
{
System.out.println("Stack overflow");
return;
}
else
{
top++;
stk[top]=item;
}
}
public Object pop()
{
if(top<0)
{
return -999;
}
else
{
Object ele=stk[top];
top--;
size_of_stack--;
return ele;
}
}
}
public class StackDemo
{
public static void main(String args[])
{
Stack myStack = new Stack();
myStack.push(10);
Object element1 = myStack.pop();
Object element2 = myStack.pop();
System.out.println(element2);
}
}
A. stack is full
B. 20
C. 0
D. -999
Solution: The first call to pop() returns 10, whereas the second call to pop() would result in stack underflow and the program returns -999.
Q: What is the time complexity of pop() operation when the stack is implemented using an array?
A. O(1)
B. O(n)
C. O(logn)
D. O(nlogn)
Solution: pop() accesses only one end of the structure, and hence constant time.
Q: Which of the following array position will be occupied by a new element being pushed for a stack of size N elements(capacity of stack > N)?
A. S[N-1]
B. S[N]
C. S[1]
D. S[0]
Solution: Elements are pushed at the end, hence N.
Q: What happens when you pop from an empty stack while implementing using the Stack ADT in Java?
A. Undefined error
B. Compiler displays a warning
C. EmptyStackException is thrown
D. NoStackException is thrown
Solution: The Stack ADT throws an EmptyStackException if the stack is empty and a pop() operation is tried on it.
Q: What is the functionality of the following piece of Java code?
Assume: ‘a’ is a non empty array of integers, the Stack class creates an array of specified size and provides a top pointer indicating TOS(top of stack), push and pop have normal meaning.
public void some_function(int[] a)
{
Stack S=new Stack(a.length);
int[] b=new int[a.length];
for(int i=0;i
A. print alternate elements of array
B. duplicate the given array
C. parentheses matching
D. reverse the array
Solution: Every element from the given array ‘a’ is pushed into the stack, and then the elements are popped out into the array ‘b’. Stack is a LIFO structure, this results in reversing the given array.
Q: Array implementation of Stack is not dynamic, which of the following statements supports this argument?
A. space allocation for array is fixed and cannot be changed during run-time
B. user unable to give the input for stack operations
C. a runtime exception halts execution
D. improper program compilation
Solution: You cannot modify the size of an array once the memory has been allocated, adding fewer elements than the array size would cause wastage of space, and adding more elements than the array size at run time would cause Stack Overflow.
Q: Which of the following array element will return the top-of-the-stack-element for a stack of size N elements(capacity of stack > N)?
A. S[N-1]
B. S[N]
C. S[N-2]
D. S[N+1]
Solution: Array indexing start from 0, hence N-1 is the last index.